Computational Challenges in Propositional Reasoning and Search
نویسندگان
چکیده
The past several years have seen much progress in the area of propositional reasoning and sat-issability testing. There is a growing consensus by researchers on the key technical challenges that need to be addressed in order to maintain this momentum. This paper outlines concrete technical challenges in the core areas of systematic search, stochastic search, problem encod-ings, and criteria for evaluating progress in this area.
منابع مشابه
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are ba...
متن کاملComprehension of factual, nonfactual, and counterfactual conditionals by Iranian EFL learners
A considerable amount of studies have been established on conditional reasoning supporting mental model theory of propositional reasoning. Mental model theory proposed by Johnson- larid and Byrne is an explanation of someone's thought process about how something occurs in the real world. Conditional reasoning as a kind of reasoning is the way to speak about possibilities or probabilities. The a...
متن کاملSatisfiability Testing: Recent Developments and Challenge Problems
Recently, there has been much progress in the area of prepositional reasoning and search. Current techniques can handle problem instances with thousands of variables and up to a million clauses. This has led to new applications in areas such as planning, scheduling, protocol verification, and software testing. Much of the recent progress has resulted from a better understanding of the computati...
متن کاملLogically-complete Local Search for Propositional Nonmonotonic Knowledge Bases
In this paper, a new approach to compute nonmonotonic inferences in a simple but useful propositional model-preference formalism is presented. It is original from at least two points of view. First, it makes use of local search techniques while preserving logical completeness. Second, it proves experimentally eecient for an important class of very large nonmonotonic knowledge bases. More precis...
متن کاملTen Challenges Redux: Recent Progress in Propositional Reasoning and Search
In 1997 we presented ten challenges for research on satisfiability testing [1]. In this paper we review recent progress towards each of these challenges, including our own work on the power of clause learning and randomized restart policies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997